Representations of quivers over finite fields
نویسندگان
چکیده
منابع مشابه
Representations of Reductive Groups Over Finite Fields
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Annals of Mathematics is collaborating with JSTOR to digit...
متن کاملRepresentations of Quivers over F 1
We define and study the category Rep(Q, F1) of representations of a quiver in Vect(F1) the category of vector spaces ”over F1”. Rep(Q, F1) is an F1–linear category possessing kernels, co-kernels, and direct sums. Moreover, Rep(Q, F1) satisfies analogues of the Jordan-Hölder and Krull-Schmidt theorems. We are thus able to define the Hall algebra HQ of Rep(Q, F1), which behaves in some ways like ...
متن کاملClassical Wavelet Transforms over Finite Fields
This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...
متن کاملClassical wavelet systems over finite fields
This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...
متن کاملComputing irreducible representations of supersolvable groups over small finite fields
We present an algorithm to compute a full set of irreducible representations of a supersolvable group G over a finite field K, charK |G|, which is not assumed to be a splitting field of G. The main subroutines of our algorithm are a modification of the algorithm of Baum and Clausen (Math. Comp. 63 (1994), 351–359) to obtain information on algebraically conjugate representations, and an effectiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1999
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700032743